FMC: An Approach for Privacy Preserving OLAP
نویسندگان
چکیده
To preserve private information while providing thorough analysis is one of the significant issues in OLAP systems. One of the challenges in it is to prevent inferring the sensitive value through the more aggregated non-sensitive data. This paper presents a novel algorithm FMC to eliminate the inference problem by hiding additional data besides the sensitive information itself, and proves that this additional information is both necessary and sufficient. Thus, this approach could provide as much information as possible for users, as well as preserve the security. The strategy does not impact on the online performance of the OLAP system. Systematic analysis and experimental comparison are provided to show the effectiveness and feasibility of FMC.
منابع مشابه
A centralized privacy-preserving framework for online social networks
There are some critical privacy concerns in the current online social networks (OSNs). Users' information is disclosed to different entities that they were not supposed to access. Furthermore, the notion of friendship is inadequate in OSNs since the degree of social relationships between users dynamically changes over the time. Additionally, users may define similar privacy settings for their f...
متن کاملA Constraint-Based Framework for Computing Privacy Preserving OLAP Aggregations on Data Cubes
A constraint-based framework for computing privacy preserving OLAP aggregations on data cubes is proposed and experimentally assessed in this paper. Our framework introduces a novel privacy OLAP notion, which, following consolidated paradigms of OLAP research, looks at the privacy of aggregate patterns defined on multidimensional ranges rather than the privacy of individual tuples/data-cells, l...
متن کاملTheory-Inspired Optimizations for Privacy Preserving Distributed OLAP Algorithms
Actually, a lot of attention focusing on the problem of computing privacy-preserving OLAP cubes effectively and efficiently arises. State-of-theart proposals rather focus on an algorithmic vision of the problem, and neglect relevant theoretical aspects the investigated problem introduces naturally. In order to fulfill this gap, in this paper we provide algorithms for supporting privacy-preservi...
متن کاملAn Information-Theoretic Approach for Privacy Protection in OLAP Systems
We address issues related to the protection of private information in Online Analytical Processing (OLAP) systems, wherea major privacy concern is the adversarial inference of private information from OLAP query answers. Most previous work onprivacy-preserving OLAP focuses on a single aggregate function and/or addresses only exact disclosure, which eliminates fromconsideration an im...
متن کاملA Comprehensive Theoretical Framework for Privacy Preserving Distributed OLAP
This paper complements the privacy preserving distributed OLAP framework proposed by us in a previous work by introducing four major theoretical properties that extend models and algorithms presented in the previous work, where the experimental validation of the framework has also been reported. Particularly, our framework makes use of the CUR matrix decomposition technique as the elementary co...
متن کامل